Hardness of Parameterized Resolution
نویسندگان
چکیده
From 07/02/10 to 12/02/10, the Dagstuhl Seminar 10061 Circuits, Logic, and Games was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
On Parameterized Intractability: Hardness and Completeness
We study the theory and techniques developed in the research of parameterized intractability, emphasizing on parameterized hardness and completeness that imply (stronger) computational lower bounds for natural computational problems. Moreover, the fundamentals of the structural properties in parameterized complexity theory, relationships to classical complexity theory and more recent developmen...
متن کاملApproximability and parameterized complexity of multicover by c-intervals
A c-interval is the disjoint union of c intervals over N. The c-IntervalMulticover problem is the special case of SetMulticover where all sets available for covering are c-intervals. We strengthen known APX-hardness results for c-IntervalMulticover, show W[1]-hardness when parameterized by the solution size, and present fixed-parameter algorithms for alternative parameterizations.
متن کاملSatisfiability of Acyclic and Almost Acyclic CNF Formulas
We show that the SATISFIABILITY (SAT) problem for CNF formulas with β-acyclic hypergraphs can be solved in polynomial time by using a special type of Davis-Putnam resolution where each resolvent is a subset of a parent clause. We extend this class to CNF formulas for which this type of DavisPutnam resolution still applies and show that testing membership in this class is NP-complete. We compare...
متن کاملSatisfiability of Acyclic and almost Acyclic CNF Formulas (II)
We show that the SATISFIABILITY (SAT) problem for CNF formulas with β-acyclic hypergraphs can be solved in polynomial time by using a special type of Davis-Putnam resolution where each resolvent is a subset of a parent clause. We extend this class to CNF formulas for which this type of Davis-Putnam resolution still applies and show that testing membership in this class is NP-complete. We compar...
متن کاملVariants of Constrained Longest Common Subsequence
In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s1 and s2 over an alphabet Σ, a set Cs of strings, and a function Co : Σ → N , the DC-LCS problem consists in finding the longest subsequence s of s1 and s2 such that s is a supersequence of all the strings in Cs and such that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 17 شماره
صفحات -
تاریخ انتشار 2010